Dihedral Codes with Prescribed Minimum Distance
نویسندگان
چکیده
Dihedral codes, particular cases of quasi-cyclic have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension minimum distance, in analogy with the theory BCH codes. This us construct dihedral codes prescribed distance. binary case, present examples optimal obtained by construction.
منابع مشابه
Construction of linear codes with prescribed minimum distance
We construct linear codes over finite fields with prescribed minimum distance by selectiong columns of the generator matrix. This selection problem can be formulated as an integer programming problem. In order to reduce the search space we prescribe a group of automorphisms. Then, in many cases the resulting integer programming problem can be solved by lattice point enumeration. With this appro...
متن کاملConstruction of Linear Codes Having Prescribed Primal-dual Minimum Distance with Applications in Cryptography
A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extend...
متن کاملConstruction of Large Constant Dimension Codes with a Prescribed Minimum Distance
In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper [13] by Kötter and Kschischang were they gave an application in network coding. There is also a connection to the theory of designs over finite fields. We will modify a method of Braun, Kerber and Laue [7] which they used for the construction of...
متن کاملSkew codes of prescribed distance or rank
In this paper we propose two methods to produce block codes of prescribed rank or distance. Following [4, 5] we work with skew polynomial rings of automorphism type and the codes we investigate are ideals in quotients of this ring. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section. 1 Galois theory of di...
متن کاملA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-68869-1_8